ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

Source URL: www.math.lsa.umich.edu

• Mathematics
• Permutations
• Linear algebra
• Matrix theory
• Algebra
• Permanent
• Computing the permanent
• Permutation
• Hamiltonian path
• Tournament

Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro

Source URL: dl.dropboxusercontent.com

• Graph theory
• Graph operations
• Graph coloring
• Chordal graph
• Graph minor
• Cograph
• Intersection graph
• RobertsonSeymour theorem
• Forbidden graph characterization
• Clique
• Pathwidth
• Line graph

(B) DAWG Breeds (1/3) “DAWG” (directed acyclic word graph) describes a diagram that stores a set of words in a graph (in the sense of a web of paths) that is directed (each path can only be traveled in one direction)

Source URL: www.nacloweb.org

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

(B) DAWG Breeds (1/3) “DAWG” (directed acyclic word graph) describes a diagram that stores a set of words in a graph (in the sense of a web of paths) that is directed (each path can only be traveled in one direction)

Source URL: nacloweb.org

Online Appendix: Network Methods [Systemic Loops and Liquidity Regulation], by Iñaki Aldasoro and Ester Faia This appendix presents more formal detail regarding the network measures used to characterize the simulated in

Source URL: aldasoro.me

• Network theory
• Networks
• Algebraic graph theory
• Network analysis
• Graph theory
• Centrality
• Assortativity
• Modularity
• Betweenness centrality
• Community structure
• Clustering coefficient
• Average path length

Practical Issues and Algorithms for Analyzing Terrorist Networks1 Tami Carpenter, George Karakostas, and David Shallcross Telcordia Technologies 445 South Street Morristown, NJKeywords: social network analysis, ce

Source URL: www.cas.mcmaster.ca

• Graph theory
• Mathematics
• Network theory
• Discrete mathematics
• Network analysis
• Networks
• Algebraic graph theory
• Centrality
• Betweenness centrality
• Closeness centrality
• Social network analysis
• Shortest path problem

Digraphs Methods for digraphs Version 0.5 Jan De Beule Julius Jonušas

Source URL: www.gap-system.org

• Graph theory
• Graph connectivity
• Directed graph
• Digraph
• Reachability
• Path
• Graph
• Vertex
• Gh

Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates. Silvio Frischknecht Stephan Holzer

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Edsger W. Dijkstra
• Spanning tree
• Combinatorial optimization
• Network theory
• Shortest path problem
• Connectivity
• Distributed computing
• Minimum spanning tree
• Clique
• Matching

Asymptotic Learning on Bayesian Social Networks∗ Elchanan Mossel Allan Sly Omer Tamuz

Source URL: people.hss.caltech.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Bayesian network
• Graph isomorphism
• Directed graph
• Ear decomposition
• Graph
• Expander graph
• Eulerian path